Computing cube roots when a fast square root is available

Fast Floating Point Square Root

Hain and Freire have proposed different floating point square root algorithms that can be efficiently implemented in hardware. The algorithms are compared and evaluated on both performance and precision.

Computing Square Roots using the Babylonian Method

We implement the Babylonian method [1] to compute square roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for linear ordered fields.

Planar graphs with square or cube root are four-colorable

Fast Incremental Square Root Information Smoothing

We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-scale environments. The main advantages over filter-based algorithms are that we solve the full SLAM problem without the need for any approximations, and that we do not suffer from linearization errors. We achieve efficie...

Computing the Square Roots of a Class of Circulant Matrices